e-merge: A Heuristic for Improving Minimum Power Broadcast Trees in Wireless Networks
نویسندگان
چکیده
Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all nodes closer will also be reached. Heuristic algorithms for constructing the minimum power tree in wireless networks have been proposed by Wieselthier et al [1] and Stojmenovic et al [4]. In this paper, we present the e-merge procedure, a heuristic for improving minimum power broadcast (MPB) trees in wireless networks. Simulation results show that better solutions are usually obtained, with considerably lower tree power, if the proposed procedure is applied to the trees generated using the Broadcast Incremental Power (BIP) algorithm discussed in [1].
منابع مشابه
A Cluster-merge Algorithm for Solving the Minimum Power Broadcast Problem in Large Scale Wireless Networks
In this paper, we address the minimum power broadcast problem in wireless networks. Assuming nodes are equipped with omni-directional antennas, the inherently broadcast nature of wireless networks can be exploited to compute power efficient routing trees. We propose a 2-stage cluster-merge algorithm for computing minimum power broadcast trees. The cluster phase is a look-ahead variant of the Br...
متن کاملR-shrink: a Heuristic for Improving Minimum Power Broadcast Trees in Wireless Networks
Broadcasting in wireless networks, unlike wired networks, inherently reaches several nodes with a single transmission. For omni-directional wireless broadcast to a node, all nodes closer will also be reached. This property can be used to compute routing trees which minimize the sum of the transmitter powers. It has been shown that this problem is NP-complete. In this paper, we present the r-shr...
متن کاملTHE MINIMUM POWER BROADCAST PROBLEM IN WIRELESS NETWORKS : AN ANT COLONY SYSTEM APPROACH Short Paper
Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all nodes closer will also be reached. Heuristics for constructing minimum power trees in wireless networks have been proposed by Wieselthier et al [1] and Stojmenovic et al [2]. In this paper, we present an Ant Colony Syste...
متن کاملMinimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations
Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all nodes closer will also be reached. Heuristic algorithms for constructing the minimum power tree in wireless networks have been proposed by Wieselthier et al. and Stojmenovic et al. Recently, an evolutionary search proced...
متن کاملMinimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms
Both integer programming models and heuristic algorithms have been proposed for finding minimum-energy broadcast and multicast trees in wireless ad hoc networks. Among heuristic algorithms, the broadcast/multicast incremental power (BIP/MIP) algorithm is most known. The theoretical performance of BIP/MIP has been quantified in several studies. To assess the empirical performance of BIP/MIP and ...
متن کامل